Connectivity-splitting models for survivable network design
نویسندگان
چکیده
منابع مشابه
Connectivity-splitting models for survivable network design
The survivable network design (SND) problem seeks a minimum cost robust network configuration that provides a specified number of alternate (edge-disjoint) paths between nodes of the network. For this problem, we present a family of new mixed integer programming formulations whose associated linear programming relaxations can be tighter than that of the usual cutset formulation. The new formula...
متن کاملConnectivity Upgrade Models for Survivable Network Design
Infrastructure networks to transport material, energy, and information are critical for today’s interconnected economies and communities, and network disruptions and failures can have serious economic and even catastrophic consequences. Since these networks require enormous investments, network service providers emphasize both survivability and cost-effectiveness in their network design decisio...
متن کاملSurvivable Network Design for Group Connectivity in Low-Treewidth Graphs
In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph G = (V ,E) on n vertices, together with a root vertex r and a collection of groups {Si}i∈[h] : Si ⊆ V (G). The goal is to find a minimum-cost subgraph H that connects the root to every group. We consider a fault-tolerant variant of GST, which we call Restricted (Rooted) Group SNDP. In this setting, each grou...
متن کاملOn the Survivable Network Design Problem with Mixed Connectivity Requirements
A graph is said to be (k, l)-connected if the resulted graph after removing of any k vertices and (l−1) edges or removing of any (k−1) vertices and l edges is still connected. Beineke and Harary (1967) (see [1]) claimed to prove that there should be k+ l edge-disjoint paths, of which k are vertex-disjoint, between any pair of vertices if the graph has (k, l)-connectivity. However, Mader (1979) ...
متن کاملHierarchical approach for survivable network design
A central design challenge facing network planners is how to select a cost-effective network configuration that can provide uninterrupted service despite edge failures. In this paper, we study the Survivable Network Design (SND) problem, a core model underlying the design of such resilient networks that incorporates complex cost and connectivity trade-offs. Given an undirected graph with specif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2003
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.10100